Direct Algorithm for Bernstein Enclosure Boundary of Polynomials

Multivariate polynomials of finite degree can be expanded into Bernstein form over a given simplex domain. The minimum and maximum control points optimize the polynomial curve same In this paper, we address methods for computing these in simplicial case L . To end, provide arithmetic operations properties obtaining fast computational method coefficients. Furthermore, give an algorithm direct determination coefficients (enclosure boundary) multivariate case. Subsequently, implicit form, monotonicity, dominance cases are investigated.